منابع مشابه
Resolvability and Monotone Normality
A space X is said to be κ-resolvable (resp. almost κ-resolvable) if it contains κ dense sets that are pairwise disjoint (resp. almost disjoint over the ideal of nowhere dense subsets). X is maximally resolvable iff it is ∆(X)-resolvable, where ∆(X) = min{|G| : G 6= ∅ open}. We show that every crowded monotonically normal (in short: MN) space is ω-resolvable and almost μ-resolvable, where μ = mi...
متن کاملResolvability of Infinite Designs
In this paper we examine the resolvability of infinite designs. We show that in stark contrast to the finite case, resolvability for infinite designs is fairly commonplace. We prove that every t-(v, k,Λ) design with t finite, v infinite and k, λ < v is resolvable and, in fact, has α orthogonal resolutions for each α < v. We also show that, while a t-(v, k,Λ) design with t and λ finite, v infini...
متن کاملResolvability of references in users' personal collections
Introduction. Digital library users collect, enhance and manage their online reference collections to facilitate their research tasks. These personal collections, therefore, are likely to reflect users' interests, and are representative of their profile. Understanding these collections offers great opportunities for developing personalized digital library services, such as reference recommender...
متن کاملResolvability on Continuous Alphabets
We characterize the resolvability region for a large class of point-to-point channels with continuous alphabets. In our direct result, we prove not only the existence of good resolvability codebooks, but adapt an approach based on the Chernoff-Hoeffding bound to the continuous case showing that the probability of drawing an unsuitable codebook is doubly exponentially small. For the converse par...
متن کاملOn connected resolvability of graphs
For an ordered set W = {w1, w2, · · · , wk} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the k-vector r(v|W ) = (d(v, w1), d(v, w2), · · · , d(v, wk)), where d(x, y) represents the distance between the vertices x and y. The set W is a connected resolving set for G if distinct vertices of G have distinct representations with respect to W and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied General Topology
سال: 2004
ISSN: 1989-4147,1576-9402
DOI: 10.4995/agt.2004.1969